Linear cofactor relationships in Boolean functions
نویسندگان
چکیده
منابع مشابه
Linear symmetries of Boolean functions
In this note we study the linear symmetry group LS(f ) of a Boolean function f of n variables, that is, the set of all ∈ GLn(2) which leave f invariant, where GLn(2) is the general linear group on the field of two elements. The main problem is that of concrete representation: which subgroups G of GLn(2) can be represented as G= LS(f ) for some n-ary k-valued Boolean function f. We call such sub...
متن کاملProjective cofactor decompositions of Boolean functions and the satisfiability problem
Given a CNF formula F , we present a new algorithm for deciding the satisfiability (SAT) of F and computing all solutions of assignments. The algorithm is based on the concept of cofactors known in the literature. This paper is a fallout of the previous work by authors on Boolean satisfiability [11, 12, 13], however the algorithm is essentially independent of the orthogonal expansion concept ov...
متن کاملRelationships between Boolean Functions and Symmetric Groups
We study the relations between boolean functions and symmetric groups. We consider elements of a symmetric group as variable transformation operators for boolean functions. Boolean function may be xed or permuted by these operators. We give some properties relating the symmetric group Sn and boolean functions on Vn.
متن کاملRepresenting Boolean Functions as Linear Pseudo-Boolean Constraints
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · l1 + . . .+am · lm ≥ d, where each li is a literal (it assumes the value 1 or 0 depending on whether a propositional variable xi is true or false) and the a1, . . . , am, d are natural numbers. The formalism can be viewed as a generalisation of a propositional clause. It has been said that LPBs can be used to represent B...
متن کاملCryptographical Boolean Functions Construction from Linear Codes
This paper presents an extension of the Maiorana-McFarland method for building Boolean functions with good cryptographic properties. The original Maiorana-McFarland construction was proposed to design bent functions. Then, it was extended in [1] to build highly nonlinear resilient functions. The classical construction splits the set of variables into two separate subsets. There, is proposed a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2006
ISSN: 0278-0070
DOI: 10.1109/tcad.2005.855951